Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(a,y) |
→ f(y,g(y)) |
| 2: |
|
g(a) |
→ b |
| 3: |
|
g(b) |
→ b |
|
There are 2 dependency pairs:
|
| 4: |
|
F(a,y) |
→ F(y,g(y)) |
| 5: |
|
F(a,y) |
→ G(y) |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
The usable rules are {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006